Algebraic semantics of logic programs with negation: Characterization of weak interlaced bilattices
نویسنده
چکیده
We consider fundamental properties of weak interlaced bilattices and give a characterization theorem of them, that is, for any weak interlaced bilattice W there exists a bounded lattice L such that W can be embedded into a typical weak interlaced bilattice K(L). Hence, any interlaced bilattice can be embedded into the weak interlaced bilattice K(L) for some lattice L.
منابع مشابه
A Duality Theory for
Recent studies of the algebraic properties of bilattices have provided insight into their internal structures, and have led to practical results, especially in reducing the computational complexity of bilattice-based multi-valued logic programs. In this paper the representation theorem for interlaced bilattices with negation found in 18] and extended to arbitrary interlaced bilattices without n...
متن کاملThe logic of distributive bilattices
Bilattices, introduced by Ginsberg [26] as a uniform framework for inference in Artificial Intelligence, are algebraic structures that proved useful in many fields. In recent years, Arieli and Avron [3] developed a logical system based on a class of bilattice-based matrices, called logical bilattices, and provided a Gentzen-style calculus for it. This logic is essentially an expansion of the we...
متن کاملCombining Explicit Negation and Negation by Failure via Belnap's Logic Combining Explicit Negation and Negation by Failure via Belnap's Logic
This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation, allowing two diierent forms of uncertainty reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued log...
متن کاملCombining Explicit Negation and Negation by Failure Via Belnap's Logic
This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation. This allows two diierent forms of reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued logic, and a...
متن کاملBilattices with Implications
In a previous work we studied, from the perspective of Abstract Algebraic Logic, the implicationless fragment of a logic introduced by O. Arieli and A. Avron using a class of bilattice-based logical matrices called logical bilattices. Here we complete this study by considering the Arieli-Avron logic in the full language, obtained by adding two implication connectives to the standard bilattice l...
متن کامل